Reprint of: Extreme point and halving edge search in abstract order types
نویسندگان
چکیده
منابع مشابه
Hybrid extreme point tabu search
We develop a new hybrid tabu search method for optimizing a continuous diieren-tiable function over the extreme points of a polyhedron. The method combines extreme point tabu search with traditional descent algorithms based on linear programming. The tabu search algorithm utilizes both recency-based and frequency-based memory and oscillates between local improvement and diversiication phases. T...
متن کاملHalving Point Sets
Given n points in R d , a hyperplane is called halving if it has at most bn=2c points on either side. How many partitions of a point set (into the points on one side, on the hyperplane, and on the other side) by halving hyperplanes can be realized by an n-point set in R d ? Consider the following algorithmic problem rst. Given n points in R d , we want to nd a hyperplane that minimizes the sum ...
متن کاملthe relationship between teaching styles and personality types of efl teachers in iranian schools
معلمان یکی از موثرترین عنصر برای موفقیت در هر سیستم آموزشی می باشند. این تحقیق? رابطه بین شخصیت معلمان و سبک های آموزشی شان را در محیط یادگیری زبان انگلیسی در ایران بررسی می کند. بهمین جهت? با توجه به موارد موجود? تعداد 45 نفر از معلمان زبان از مدارس مختلف تبریز انتخاب شدند. اطلاعات از طریق نوع شخصیت معلم و فهرستی از سبکهای آموزشی شان جمع آوری شد. تجزیه و تحلیل داده ها نشان داد که رابطه معنی دا...
Fastest Quantum Search for Extreme Point
Let φ be some integer function on words of length n and oracle Oφ gives the value φ(x) for a given x. It is shown how quantum algorithm can find a point of maximum of φ with the probability of error 2/3 applying oracle Oφ 32 √ 2n times. This algorithm is optimal in within constant factor in the following sense. Any other algorithm acting in substantially shorter time o( √ 2n) (n −→ ∞) gives inc...
متن کاملElectronic Reprint Order Form
We propose and analyze spillover-partitioning call admission control (CAC) for servicing multiple service classes in mobile wireless networks for revenue optimization with quality of service (QoS) guarantees. We evaluate the performance of spillover-partitioning CAC in terms of execution time and optimal revenue obtainable by comparing it with existing CAC algorithms, including partitioning, th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2014
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2013.11.002